Optical index of fault tolerant routings in WDM networks

Fault-tolerant routings with minimum optical index

Combinatorial constructions of fault-tolerant routings with levelled minimum optical indices

The design of fault-tolerant routings with levelled minimum optical indices plays an important role in the context of optical networks. However, not much is known about the existence of optimal routings with levelled minimum optical indices besides the results established by Dinitz, Ling and Stinson via the partitionable Steiner quadruple systems approach. In this paper, we introduce a new conc...

A Dynamic Partitioning Sub-Path Protection Routing Technique in WDM Mesh Networks

With the increasing popularity of bandwidth-intensive applications, network traffic has been growing exponentially. Wavelength Division Multiplexing (WDM) is a technique that can harness the huge bandwidth available in an optical fiber to satisfy the network demand. Due to the multiplicity of the connections on any single link, fault tolerance is of utmost importance in such WDM networks. Activ...

Fault Tolerant Routings in Complete Multipartite Graph

The f -tolerant arc-forwarding index for a class of complete multipartite graphs are determined by constructing relevant fault tolerant routings. Furthermore, these routings are leveled for Cocktail-party graph and the complete 3-partite graph. Mathematics Subject Classification: 05C38, 05C90, 90B10

Fault Tolerant Forwarding and Optical Indexes: A Design Theory Approach

We study the problem of designing fault tolerant routings in both complete and complete bipartite optical networks. We show that this problem has strong connections to various fundamental problems in design theory. Using a design theory approach, we find optimal f-fault tolerant arc-forwarding indexes for all complete networks and all complete balanced bipartite networks. Similarly, we find alm...